Explicit formulas for a sequence of binary tree polynomials
نویسندگان
چکیده
منابع مشابه
Explicit formulas for the generalized Hermite polynomials in superspace
We provide explicit formulas for the orthogonal eigenfunctions of the supersymmetric extension of the rational Calogero-Moser-Sutherlandmodel with harmonic confinement, i.e., the generalized Hermite (or Hi-Jack) polynomials in superspace. The construction relies on the triangular action of the Hamiltonian on the supermonomial basis. This translates into determinantal expressions for the Hamilto...
متن کاملExplicit Formulas Involving q-Euler Numbers and Polynomials
and Applied Analysis 3 Similarly, the q-Bernoulli polynomials and numbers with weight 0 are defined, respectively, as B̃n,q x lim n→∞ 1 [ pn ] q pn−1 ∑ y 0 ( x y )n q
متن کاملBinary cyclic codes from explicit polynomials over GF(2m)
Cyclic codes are a subclass of linear codes and have applications in consumer electronics, data storage systems, and communication systems as they have efficient encoding and decoding algorithms. In this paper, monomials and trinomials over finite fields with even characteristic are employed to construct a number of families of binary cyclic codes. Lower bounds on the minimum weight of some fam...
متن کاملExplicit formulas for five-term recurrence coefficients of orthogonal trigonometric polynomials of semi-integer degree
Orthogonal systems of trigonometric polynomials of semi-integer degree with respect to a weight function w(x) on [0, 2π) have been considered firstly by Turetzkii in [Uchenye Zapiski, Vypusk 1(149) (1959), 31–55, (translation in English in East J. Approx. 11 (2005) 337–359)]. It is proved that such orthogonal trigonometric polynomials of semi-integer degree satisfy five-term recurrence relation...
متن کاملFactorization formulas for MacDonald polynomials
In [LLT1], Lascoux, Leclerc and Thibon give some factorisation formulas for Hall-Littlewood functions when the parameter q is specialized at roots of unity. They also give formulas in terms of cyclic characters of the symmetric group. In this article, we give a generalization of these specializations for different versions of the Macdonald polynomials and we obtain similar formulas in terms of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2013
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2012.05.033